Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
نویسندگان
چکیده
منابع مشابه
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Yu-Hong Dai1, Roger Fletcher2 1 State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, PO Box 2719, Beijing, 100080, PR China; e-mail: [email protected] 2 Department of Mathematics, University of Dundee, Dundee DD1 4HN, Scotland, UK; e-mail...
متن کاملQuadratic regularization projected alternating Barzilai–Borwein method for constrained optimization
In this paper, based on the regularization techniques and projected gradient strategies, we present a quadratic regularization projected alternating Barzilai–Borwein (QRPABB) method for minimizing differentiable functions on closed convex sets. We show the convergence of the QRPABB method to a constrained stationary point for a nonmonotone line search. When the objective function is convex, we ...
متن کاملTrajectory-following methods for large-scale degenerate convex quadratic programming
We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nondegerate and degenerate problems, where degeneracy is understood to mean the failure of strict complementarity at a solution. Global convergence and a polynomial bound on the number of iterations required is given. An implementation, CQP, is a...
متن کاملProjected Barzilai-borwein Method with Infeasible Iterates for Nonnegative Image Deconvolution
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x List of Abbreviations and Symbols Used . . . . . . . . . . . . . . . . . . xi Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii Chapter
متن کاملAn Algorithm for Large-Scale Quadratic Programming
We are particularly concerned in solving (1.1) when n is large and the vectors a, and matrix H are sparse. We do not restrict H to being positive (semi-)definite and consequently are content with finding local solutions to (1.1). Of course, for many classes of problem, it is known a priori that any local solution is a global one. Our method is fundamentally related to that proposed by Fletcher ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerische Mathematik
سال: 2005
ISSN: 0029-599X,0945-3245
DOI: 10.1007/s00211-004-0569-y